Computing optimal strategy for cop in the game of Cop v.s. Gambler
نویسنده
چکیده
We present an efficient algorithm that computes the optimal strategy for cop in the game of Cop v.s. Gambler where the gambler’s strategy is not optimal but known to the cop. The algorithm runs inO(|V (G)||E(G)|) time.
منابع مشابه
Variations of the cop and robber game on graphs
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all c < 1 that almost all random graphs are stalemate for the cop and killer game, where each edge occurs with probability p such that 1 nc ≤ p ≤ 1 − 1 nc . We prove that a g...
متن کاملCop-Win Graphs: Optimal Strategies and Corner Rank
The game of cops and robber is a two-player game, played on a graph, between a cop and a robber. To begin the game, the cop and robber each choose a vertex to occupy, with the cop choosing first. Play then alternates between the cop and the robber, with the cop moving first; on a turn a player may move to an adjacent vertex or stay still. If the cop and robber ever occupy the same vertex, the c...
متن کاملSimultaneously moving cops and robbers
In this paper we study the concurrent cops and robber (CCCR) game. CCCR follows the same rules as the classical, turn-based game, except for the fact that the players move simultaneously. The cops' goal is to capture the robber and the concurrent cop number of a graph is defined the minimum number of cops which guarantees capture. For the variant in which it it required to capture the robber in...
متن کاملAn anti-incursion algorithm for unknown probabilistic adversaries on connected graphs
A gambler moves on the vertices 1, . . . , n of a graph using the probability distribution p1, . . . , pn. A cop pursues the gambler on the graph, only being able to move between adjacent vertices. What is the expected number of moves that the gambler can make until the cop catches them? Komarov and Winkler proved an upper bound of approximately 1.97n for the expected capture time on any connec...
متن کاملThe role of quantum correlations in Cop and Robber game
We introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to the controlled operations, we define a quantum-controlled Cop and Robber game,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1701.00187 شماره
صفحات -
تاریخ انتشار 2017